First Multiflow Summer School on Turbulence

Summer School on Quantum Information

On Integer Multiflow Maximization

Generalizing the two-commodity ow theorem of Rothschild and Whinston and the multiiow theorem of Lovv asz and Cherkasskij, Karzanov and Lomonosov proved a min-max theorem on maximum multiiows in the seventies. Their original proof is quite long and technical and relies on earlier investigations on metrics. The main purpose of the present paper is to provide a relatively simple proof of this the...

Report on the First Summer School on Ubiquitous and Pervasive Computing

he 2002 Summer School on Ubiquitous and Pervasive Computing was organized and run by a team of volunteers from ETH Zurich between 7th and 14th of August. The school was situated at the beautiful Dagstuhl Castle in Germany, close to the border of Luxembourg and France, and built on the success of the Ubiquitous Computing Seminar held in the same location the previous year. The lecturers were Joh...

Fields Summer School on Approximability of CSPs

These lectures will be about the approximability of constraint satisfaction problems (CSPs). Definition 1.1. Let D be a domain of cardinality q. We usually write D = {0,1,2, . . . , q − 1} and often call the elements of D labels. Let Γ be a nonempty finite set of nontrivial relations (predicates) over D, with each R ∈ Γ having arity ar(R) ≤ k. We usually write an r-ary relation as R : Dr → {0,1...

Connectionist Models Summer School

Binocular depth perception, or stereopsis, depends on matching corresponding points in two images taken from two vantage points. In random-dot stereograms the features to be matched are individual pixels. We have used the recurrent backpropagation learning algorithm of Pineda (1987) to construct network models with lateral and feedback connections that can solve the correspondence problem for r...